منابع مشابه
Unavoidable Stars in 3-Graphs
Suppose .F is a collection of 3-subsets of (1,2,..., n). The problem of determining the least integer f(n, k) with the property that if l,FT/ >f(n, k) then .7 contains a k-star (i.e., k 3-sets such that the intersection of any pair of them consists of exactly the same element) is studied. It is proved that, for k odd, f(n, k) = k(k 1) n + P(k-‘) and, for k even,f(n, k) = k(k 3/2) n + F(n + k’).
متن کاملOn unavoidable graphs
How many edges can be in a graph which is forced to be contained in every graph on n verti-ces and e edges? 1n this paper we obtain bounds which are in many cases asymptotically best possible. A well-known theorem of Turán [10,11] asserts that every graph on n vertices and e edges must contain a complete subgraph on m vertices if e~2(m 1)(n-rL)+(2) where r satisfies r-n (mod m-1) and In this pa...
متن کاملUnavoidable doubly connected large graphs
A connected graph is double connected if its complement is also connected The following Ramsey type theorem is proved in this paper There exists a function h n de ned on the set of integers exceeding three such that every double connected graph on at least h n vertices must contain as an induced subgraph a special double connected graph which is either one of the following graphs or the complem...
متن کاملUnavoidable Configurations in Complete Topological Graphs
A topological graph is a graph drawn in the plane so that its vertices are represented by points, and its edges are represented by Jordan curves connecting the corresponding points, with the property that any two curves have at most one point in common. We define two canonical classes of topological complete graphs, and prove that every topological complete graph with n vertices has a canonical...
متن کاملUnavoidable trees and forests in graphs
Classic results from extremal graph theory state that if certain graphs are made large enough, unavoidable substructures appear. Here we will cover this type of problem for specific graphs when these substructures are certain trees or forests. After giving a summary on related results, the following two extremal main problems are presented: For a given family of same-order trees including the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1983
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90011-0